Sound and complete qualitative simulation is impossible
نویسندگان
چکیده
منابع مشابه
Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation
We show that the axioms of Weak Kleene Algebra (WKA) are sound and complete for the theory of regular expressions modulo simulation equivalence, assuming their completeness for monodic trees (as conjectured by Takai and Furusawa).
متن کاملComplete Disorder is Impossible: The Mathematical Work of Walter Deuber
In 1928 the young British mathematician Frank Plumpton Ramsey had written a paper ‘On a problem in formal logic’, which was published in 1930 in the Proceedings of the London Mathematical Society. It is the paper for which he became eponymous for the field of Discrete Mathematics nowadays known as Ramsey Theory . The objective was to give a decision procedure for the sentences of propositional ...
متن کاملWeak Bisimulation is Sound and Complete for PCTL*
We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We build on the work of Philippou, Lee and Sokolsky [1] for finite state LCMCs. Their definition of weak bisimulation destroys the additivity property of the probability distributions, yielding instead capacities. The mathematics beh...
متن کاملInfinitary Term Graph Rewriting is Simple, Sound and Complete
Based on a simple metric and a simple partial order on term graphs, we develop two infinitary calculi of term graph rewriting. We show that, similarly to infinitary term rewriting, the partial order formalisation yields a conservative extension of the metric formalisation of the calculus. By showing that the resulting calculi simulate the corresponding well-established infinitary calculi of ter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2003
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(03)00077-8